Energy saving scheduling strategy for job shop under TOU and tiered electricity price
نویسندگان
چکیده
منابع مشابه
Flexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملflexible job shop scheduling under availability constraints
in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...
متن کاملA Cooperative Approach for Job Shop Scheduling under Uncertainties
This paper focuses on job shop scheduling problems in a cooperative environment. Unlike classical deterministic approaches, we assume that jobs are not known in advance but occur randomly during the production process, as orders appear. Therefore, the production schedule is adapted in a reactive manner all along the production process. These schedule adaptations are made according to a cooperat...
متن کاملA metaheuristic technique for energy-efficiency in job-shop scheduling
Many real-world scheduling problems are solved to obtain optimal solutions in term of processing time, cost and quality as optimization objectives. Currently, energy-efficiency is also taking into consideration in these problems. However, this problem is NP-Hard, so many search techniques are not able to obtain a solution in a reasonable time. In this paper, a genetic algorithm is developed to ...
متن کاملJob-shop scheduling
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Alexandria Engineering Journal
سال: 2021
ISSN: 1110-0168
DOI: 10.1016/j.aej.2021.06.008